Computing with First-Order Logic

Computing with First-Order Logic

We study two important extensions of rst-order logic (FO) with iteration, the xpoint and while queries. The main result of the paper concerns the open problem of the relationship between xpoint and while: they are the same ii ptime = pspace. These and other expressibility results are obtained using a powerful normal form for while which shows that each while computation over an unordered domain...

First Order Logic with Dependent

Computing First-Order Logic Programs by Fibring Artificial Neural Networks

The integration of symbolic and neural-network-based artificial intelligence paradigms constitutes a very challenging area of research. The overall aim is to merge these two very different major approaches to intelligent systems engineering while retaining their respective strengths. For symbolic paradigms that use the syntax of some first-order language this appears to be particularly difficul...

New methods for computing inferences in first order logic

Recent improvements in satis ability algorithms for propositional logic have made partial instantiation methods for rst order predicate logic computationally more attractive Two such methods have been proposed one by R Jeroslow and a hypergraph method for datalog formulas by G Gallo and G Rago We show that they are instances of two general approaches to partial instantiation and we develop thes...

First-Order Logic